package com.veal98.tree;

import com.veal98.bean.TreeNode;

public class MergeTwoBinaryTrees_617 {

    public TreeNode mergeTrees(TreeNode root1, TreeNode root2) {
        if (root1 == null || root2 == null) {
            return root1 == null ? root2 : root1;
        }

        // 根节点相加
        TreeNode root = new TreeNode(root1.val + root2.val);
        // 递归合并左子树
        root.left = mergeTrees(root1.left, root2.left);
        // 递归合并右子树
        root.right = mergeTrees(root1.right, root2.right);

        return root;
    }
}
